Parallel Algorithm for Solving the Graph Isomorphism Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Direct Algorithm for Solving of the Graph Isomorphism Problem
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
متن کاملSolving Graph Isomorphism Problem for a Special case
Graph isomorphism is an important computer science problem. The problem for the general case is unknown to be in polynomial time. The bese algorithm for the general case works in quasi-polynomial time [1]. The solutions in polynomial time for some special type of classes are known. In this work, we have worked with a special type of graphs. We have proposed a method to represent these graphs an...
متن کاملAn Algorithm Portfolio for the Sub-graph Isomorphism Problem
This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a new association between two vertices is compatible by considering the structure of their local neighborhoods, represented as the number of limited-length paths of different type originating from each vertex. In addition, rando...
متن کاملA new ltering algorithm for the graph isomorphism problem
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem may be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less e cient than dedicated algorithms which take advantage of the global semantic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modeling and Analysis of Information Systems
سال: 2020
ISSN: 2313-5417,1818-1015
DOI: 10.18255/1818-1015-2020-1-86-94